-
1 edge-weighted graph
Большой англо-русский и русско-английский словарь > edge-weighted graph
-
2 edge-weighted graph
Математика: реберно взвешенный граф -
3 edge-weighted graph
-
4 weighted graph
т. граф. взвешенный граф (граф, вершинам и/или ребрам которого поставлены в соответствие целые или вещественные числа (веса)) -
5 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
6 edge weight
-
7 реберно взвешенный граф
Большой англо-русский и русско-английский словарь > реберно взвешенный граф
-
8 chain weight
т. граф. вес цепиа) (в неориентированном графе: функция, определенная на множестве ребер цепи; чаще всего, сумма весов ребер)б) т. граф. (в орграфе: алгебраическая сумма весов дуг в цепи, вычисляемая по следующему правилу: вес дуги берется со знаком "+", если дуга проходится в направлении ее ориентации, и со знаком "-" в противном случае)See: -
9 population ageing
соц., демогр. старение населения, демографическое старение ( увеличение доли пожилых людей в структуре населения)Syn:Ant: -
10 weight matrix
т. граф. матрица весов (таблица, элементы которой представляют собой веса ребер графа)See: -
11 directed
a вчт. мат. ориентированныйdirected edge — ориентированное ребро, дуга
directed graph — ориентированный граф; орграф
Синонимический ряд:1. aimed (adj.) aimed; explicit; marked; personal; pointed2. controlled (adj.) assisted; conducted; controlled; guided; orderly; organized; purposeful; supervised3. addressed (verb) addressed; aimed; applied; bent; buckled; buckled down; cast; concentrated; dedicated; devoted; focused; gave; gave/given; inclined; laid; leveled or levelled; levelled; pointed; presented; set; superscribed; threw/thrown; trained; turned; zero in; zeroed in4. conducted (verb) carried on; conducted; kept; operated; ordained; ran/run5. controlled (verb) controlled; dominated; governed; handled; ruled6. guided (verb) escorted; guided; led; piloted; routed; saw/seen; shepherded; showed/shown or showed; ushered7. managed (verb) carry on; managed; steered; supervised8. ordered (verb) bade; bade or bid/bidden or bid; charged; commanded; enjoined; instructed; ordered; required; told; warned9. ran (verb) administered; administrated; headed; ran; superintended -
12 algorithm
1) алгоритм2) правило; процедура; метод•- adaptive algorithm
- Agarval-Cooley algorithm
- aim algorithm
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- backoff algorithm
- back propagation of error algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm - CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm - greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm - iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-Moore algorithm
- Lee algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm - min-cut algorithm - nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- quantum search algorithm
- quick-union algorithm
- quick-union algorithm with path compression
- Q-R-algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm - routing algorithm
- Rprop algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm - self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm - shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithm -
13 partition
1) разделение; разветвление; разбиение; распределение || разделять; разветвлять; разбивать; распределять2) перегородка || перегораживать; секционировать3) вчт выделение разделов (напр. на жёстком диске), разбиение (напр. жёсткого диска) || выделять разделы, разбивать4) вчт раздел (напр. жёсткого диска)•- partition of interval
- partition of load
- partition of tree
- admissible partition
- application partition
- arc partition
- binary partition
- cellular partition
- chain partition
- color partition
- countable partition
- diagnostic partition
- disk partition
- distributional partition
- edge partition
- exhaustive partition
- extended partition
- finite partition
- frequency partition
- functional partition
- fuzzy partition
- generating partition
- harmonic partition
- information partition
- invariant partition
- linear partition
- logical partition
- Markovian partition
- matrix partition
- measurable partition
- modular partition
- nested partition
- ordered partition
- physical partition
- plane partition
- primary partition
- random partition
- randomized partition
- set partition
- space partition
- statistical partition
- topological partition
- unordered partition
- vector partition
- vertex partition
- weighted partition -
14 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
15 algorithm
1) алгоритм2) правило; процедура; метод•- Agarval-Cooley algorithm
- aim algorithm
- algorithm of doubtful convergence
- annealing algorithm
- asymmetric encryption algorithm
- autoregressive algorithm
- back propagation of error algorithm
- backoff algorithm
- batch algorithm
- Bellman-Ford algorithm
- best cost path algorithm
- bisection algorithm
- branch and bound algorithm
- British Telecom Lempel-Ziv algorithm
- BTLZ algorithm
- CART algorithm
- channel algorithm
- channel routing algorithm
- Cholesky algorithm
- classification and regression tree algorithm
- clustering algorithm
- Cochran-Orcutt algorithm
- compression algorithm
- conjugate directions algorithm
- conjugate gradients algorithm
- constructive algorithm
- contour following algorithm
- control algorithm
- convolution algorithm
- Cooley-Tuckey algorithm
- cryptographic algorithm
- deflation compression algorithm
- differential synthesis algorithm
- Diffie-Hellman algorithm
- digital signal processing algorithm
- digital signature algorithm
- Dijkstra algorithm
- distance vector algorithm
- DSP algorithm
- dynamic programming algorithm
- edge-tracking algorithm
- evolutionary algorithm
- exact embedding algorithm
- expansion algorithm
- fast algorithm
- fast convolution Agarval-Cooley algorithm
- fixed-weight algorithm
- Ford-Fulkerson algorithm
- fundamental algorithm
- fuzzy algorithm
- general algorithm
- genetic algorithm
- graph search algorithm
- greedy algorithm
- Gummel's algorithm
- hashing algorithm
- heuristic algorithm
- ID3 algorithm
- identification algorithm
- initialization algorithm
- integer algorithm
- international data encryption algorithm
- iterative algorithm
- iterative dichotomizer 3 algorithm
- k-means algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-algorithm
- Lee-Moore algorithm
- Lee-type algorithm
- Lempel-Ziv algorithm
- Lempel-Ziv-Welch algorithm
- Levenberg-Marquardt algorithm
- LFU algorithm
- line-probe algorithm
- link state algorithm
- LU decomposition algorithm
- LZ algorithm
- LZW algorithm
- MacQueen's k-means algorithm
- McCulloch-Pitts algorithm
- memetic algorithm
- message authentication algorithm
- metaheuristic algorithm
- min-cut algorithm
- modified Gram-Schmidt algorithm
- Nelder-Mead simplex algorithm
- nested algorithm
- numerical algorithm
- Oja iterative algorithm
- on-line algorithm
- optimization algorithm
- ordering algorithm
- painter's algorithm
- parallel algorithm
- pattern classification algorithm
- pattern recognition algorithm
- pel-recursive estimation algorithm
- placement algorithm
- planning algorithm
- polynomial algorithm
- predictive algorithm
- preemptive algorithm
- Prim algorithm
- production rule based algorithm
- pruning algorithm
- pseudo least recently used algorithm
- Q-R-algorithm
- quantum search algorithm
- quick-union algorithm with path compression
- quick-union algorithm
- radix sorting algorithm
- randomized algorithm
- rank algorithm
- Read-Solomon cyclic redundancy compression algorithm
- recognition algorithm
- recurrent algorithm
- recursive algorithm
- resilient propagation algorithm
- Rivest-Shamir-Adleman algorithm
- robust algorithm
- routing algorithm
- RProp algorithm
- RSA algorithm
- scheduling algorithm
- search algorithm
- search network algorithm
- secure hash algorithm
- selective-trace algorithm
- self-organizing algorithm
- semi-numerical algorithm
- sequential algorithm
- sequential leader clustering algorithm
- serial algorithm
- shortest path algorithm
- sieving algorithm
- simulated annealing training algorithm
- simulation algorithm
- smoothing algorithm
- software algorithm
- spanning tree algorithm
- spline algorithm
- splitting algorithm
- stack algorithm
- statistical algorithm
- stochastic algorithm
- supervised training algorithm
- symmetric encryption algorithm
- time-wheel algorithm
- training algorithm
- universal algorithm
- unsupervised training algorithm
- van der Waerden algorithm
- variational algorithm
- vector distance algorithm
- Viterbi algorithm
- VLSI algorithm
- weighted quick-union algorithm
- working algorithmThe New English-Russian Dictionary of Radio-electronics > algorithm
-
16 partition
1) разделение; разветвление; разбиение; распределение || разделять; разветвлять; разбивать; распределять2) перегородка || перегораживать; секционировать3) вчт. выделение разделов (напр. на жёстком диске), разбиение (напр. жёсткого диска) || выделять разделы, разбивать4) вчт. раздел (напр. жёсткого диска)•- application partition
- arc partition
- binary partition
- cellular partition
- chain partition
- color partition
- countable partition
- diagnostic partition
- disk partition
- distributional partition
- edge partition
- exhaustive partition
- extended partition
- finite partition
- frequency partition
- functional partition
- fuzzy partition
- generating partition
- harmonic partition
- information partition
- invariant partition
- linear partition
- logical partition
- Markovian partition
- matrix partition
- measurable partition
- modular partition
- nested partition
- ordered partition
- partition of graph
- partition of interval
- partition of load
- partition of tree
- physical partition
- plane partition
- primary partition
- random partition
- randomized partition
- set partition
- space partition
- statistical partition
- topological partition
- unordered partition
- vector partition
- vertex partition
- weighted partitionThe New English-Russian Dictionary of Radio-electronics > partition
-
17 partition
1) разделение; разбиение; расчленение || разделять; разбивать; расчленять2) перегородка || ставить перегородку3) раздел || подразделять4) простенок5) распределение || распределять•
См. также в других словарях:
weighted graph — noun A graph that associates a weight (usually a real number) with every edge in the graph … Wiktionary
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Edge dominating set — Examples of edge dominating sets. In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known… … Wikipedia
Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Weighted matroid — In combinatorics, a branch of mathematics, a weighted matroid is a matroid endowed with function with respect to which one can perform a greedy algorithm.There is a simple algorithm for finding a basis:* Let A be the empty set. * For each x in E… … Wikipedia
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
